Conductors with respect to hereditary orders.
نویسندگان
چکیده
منابع مشابه
Gorenstein hereditary rings with respect to a semidualizing module
Let $C$ be a semidualizing module. We first investigate the properties of finitely generated $G_C$-projective modules. Then, relative to $C$, we introduce and study the rings over which every submodule of a projective (flat) module is $G_C$-projective (flat), which we call $C$-Gorenstein (semi)hereditary rings. It is proved that every $C$-Gorenstein hereditary ring is both cohe...
متن کاملMaximal graphs with respect to hereditary properties
A property of graphs is a non-empty set of graphs. A property P is called hereditary if every subgraph of any graph with property P also has property P. Let P1, . . . ,Pn be properties of graphs. We say that a graph G has property P1◦ · · · ◦Pn if the vertex set of G can be partitioned into n sets V1, . . . , Vn such that the subgraph of G induced by Vi has property Pi; i = 1, . . . , n. A here...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولStructure of Gröbner bases with respect to block orders
In this paper we study the structure of Gröbner bases with respect to block orders. We extend Lazard’s theorem and the Gianni-Kalkbrenner theorem to the case of a zero-dimensional ideal whose trace in the ring generated by the first block of variables is radical. We then show that they do not hold for general zero-dimensional ideals.
متن کاملMaximal Hypergraphs with Respect to the Bounded Cost Hereditary Property
The hereditary property of hypergraphs generated by the cost colouring notion is considered in the paper. First, we characterize all maximal graphs with respect to this property. Second, we give the generating function for the sequence describing the number of such graphs with the numbered order. Finally, we construct a maximal hypergraph for each admissible number of vertices showing some dens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1973
ISSN: 0026-2285
DOI: 10.1307/mmj/1029001064